Accelerating Partial-Order Planners: Some Techniques for Effective Search Control and Pruning

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Accelerating Partial-Order Planners: Some Techniques for Effective Search Control and Pruning

We propose some domain-independent techniques for bringing well-founded partial-order planners closer to practicality. The rst two techniques are aimed at improving search control while keeping overhead costs low. One is based on a simple adjustment to the default A* heuristic used by ucpop to select plans for reenement. The other is based on preferring \zero commitment" (forced) plan reenement...

متن کامل

Accelerating Partial-order Planners: Some Techniques for Eeective Search Control and Pruning

We propose some domain-independent techniques for bringing well-founded partial-order planners closer to practicality. The rst two techniques are aimed at improving search control while keeping overhead costs low. One is based on a simple adjustment to the default A* heuristic used by ucpop to select plans for reenement. The other is based on preferring \zero commitment" (forced) plan reenement...

متن کامل

Accelerating Partial-Order Planners: Some Techniques for E ective Search Control and Pruning

We propose some domain-independent techniques for bringing well-founded partialorder planners closer to practicality. The rst two techniques are aimed at improving search control while keeping overhead costs low. One is based on a simple adjustment to the default A* heuristic used by ucpop to select plans for re nement. The other is based on preferring \zero commitment" (forced) plan re nements...

متن کامل

Accelerating partial order planners by improving plan and goal choices

We describe some simple domain-independent improvements to plan-reenement strategies for well-founded partial order planning that promise to bring this style of planning closer to practicality. One suggestion concerns the strategy for selecting plans for reenement among the current (incomplete) candidate plans. We propose an A* heuristic that counts only steps and open conditions, while ignorin...

متن کامل

Failure Driven Dynamic Search Control for Partial Order Planners: An Explanation Based Approach

Given the intractability of domain-independent planning, the ability to control the search of a planner is vitally important. One way of doing this involves learning from search failures. This paper describes SNLP+EBL, the first implementation of explanation based search control rule learning framework for a partial order (plan-space) planner. We will start by describing the basic learning fram...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Artificial Intelligence Research

سال: 1996

ISSN: 1076-9757

DOI: 10.1613/jair.316